On Ramsey graphs without bipartite subgraphs
نویسندگان
چکیده
منابع مشابه
On covering graphs by complete bipartite subgraphs
We prove that, if a graph with e edges contains m vertex-disjoint edges, then m/e complete bipartite subgraphs are necessary to cover all its edges. Similar lower bounds are also proved for fractional covers. For sparse graphs, this improves the well-known fooling set lower bound in communication complexity. We also formulate several open problems about covering problems for graphs whose soluti...
متن کاملOn Bipartite Graphs with Linear Ramsey Numbers
We provide an elementary proof of the fact that the ramsey number of every bipartite graph H with maximum degree at most ∆ is less than 8(8∆)|V (H)|. This improves an old upper bound on the ramsey number of the n-cube due to Beck, and brings us closer toward the bound conjectured by Burr and Erdős. Applying the probabilistic method we also show that for all ∆≥1 and n≥∆+1 there exists a bipartit...
متن کاملDominating Bipartite Subgraphs in Graphs
A graph G is hereditarily dominated by a class D of connected graphs if each connected induced subgraph of G contains a dominating induced subgraph belonging to D. In this paper we characterize graphs hereditarily dominated by classes of complete bipartite graphs, stars, connected bipartite graphs, and complete k-partite graphs.
متن کاملoptimal orientations of subgraphs of complete bipartite graphs
for a graph g, let d(g) be the set of all strong orientations of g. the orientationnumber of g is min {d(d) |d belongs to d(g)}, where d(d) denotes the diameterof the digraph d. in this paper, we determine the orientation number for some subgraphs of complete bipartite graphs.
متن کاملSizes of Induced Subgraphs of Ramsey Graphs
An n-vertex graph G is c-Ramsey if it contains neither a complete nor an empty induced subgraph of size greater than c log n. Erdős, Faudree and Sós conjectured that every c-Ramsey graph with n vertices contains Ω(n5/2) induced subgraphs any two of which differ either in the number of vertices or in the number of edges, i.e. the number of distinct pairs (|V (H)|, |E(H)|), as H ranges over all i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1992
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90605-f